Affine Primitive Groups and Semisymmetric Graphs
نویسندگان
چکیده
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graphs, where p is an prime, 1 6 t 6 s with s > 2 while p = 2.
منابع مشابه
Semisymmetric Cubic Graphs Constructed from Bi-Cayley Graphs of An
For a group T and a subset S of T , the bi-Cayley graph BCay(T, S) of T with respect to S is the bipartite graph with vertex set T×{0, 1} and edge set {{(g, 0), (sg, 1)} | g ∈ T, s ∈ S}. In this paper, we investigate cubic bi-Cayley graphs of finite nonabelian simple groups. We give several sufficient or necessary conditions for a bi-Cayley graph to be semisymmetric, and construct several infin...
متن کاملSemisymmetric cubic graphs of twice odd order
Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric, respectively, semisymmetric. If Γ is ...
متن کاملA census of semisymmetric cubic graphs on up to 768 vertices
A list is given of all semisymmetric (edgebut not vertex-transitive) connected finite cubic graphs of order up to 768. This list was determined by the authors using Goldschmidt’s classification of finite primitive amalgams of index (3, 3), and a computer algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several previously undiscov...
متن کاملCubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
متن کاملG-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a huge usage of such graphs. Constructing symmetric and semisymmetric graphs is a large and hard problem. In this paper a tool called G-graphs and based on group theory is used. We show the efficiency of this tool for cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013